Innovations in t-way test creation based on a hybrid hill climbing-greedy algorithm

<p>In combinatorial testing development, the fabrication of covering arrays is key challenge by multiple aspects that influence it. A wide range problems can be solved using metaheuristic and greedy techniques. Combining technique utilizing a search like hill climbing (HC), produce feasible results for tests. Methods based on metaheuristics are used to deal with tuples may left after redundancy strategies; then result utilization assured near-optimal algorithm. As result, use both HC algorithms in single test generation system good candidate if constructed correctly. This study presents hybrid algorithm (HGHC) ensures effectiveness generating small number data. To make certain suggested HGHC outperforms most techniques terms size. It compared others order determine its effectiveness. In contrast recent practices utilized production (CAs) mixed (MCAs), this strategy superior since allowing it provide utmost outcome while reducing size limit loss unique pairings CA/MCA generation.</p>